Decompositions of quadrangle-free planar graphs
نویسندگان
چکیده
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and a graph with maximum degree at most 7. This degree restriction was improved to 6 by Borodin et al. We further lower this bound to 5 and show that it cannot be improved to 3.
منابع مشابه
M-degrees of quadrangle-free planar graphs
The M-degree of an edge xy in a graph is the maximum of the degrees of x and y. The M-degree of a graph G is the minimum over M-degrees of its edges. In order to get upper bounds on the game chromatic number, He et al showed that every planar graph G without leaves and 4cycles has M-degree at most 8 and gave an example of such a graph with M-degree 3. This yields upper bounds on the game chroma...
متن کاملLOCALLY TRIANGULAR GRAPHS AND NORMAL QUOTIENTS OF THE n-CUBE
For an integer n > 2, the triangular graph has vertex set the 2-subsets of {1, . . . , n} and edge set the pairs of 2-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle. We refine this result and provide a characterisation of connected locally triangular...
متن کاملThe degree/diameter problem in maximal planar bipartite graphs (Extended abstract)
The (∆, D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree ∆ and diameter D. We consider the (∆, D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We obtain that for the (∆, 2) problem, the number of vertices is n = ∆+2; and for the (∆, 3) problem, n ...
متن کاملThe Degree/Diameter Problem in Maximal Planar Bipartite graphs
The (∆, D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree ∆ and diameter D. We consider the (∆, D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We prove that for the (∆, 2) problem, the number of vertices is n = ∆ + 2; and for the (∆, 3) problem, n...
متن کاملPlanar Branch Decompositions
Branch decompositions were introduce by Robertson and Seymour 3] in their series of papers that proved Wagner's Conjecture. Branch decomposition can be used to solve NP-complete problems modeled on graphs but nding optimal branch decompositions of graphs is also NP-complete. We propose a practical implementation of an algorithm of Sey-mour and Thomas 4] for computing optimal branch decompositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2009